Self-Referential Justifications in Epistemic Logic
نویسندگان
چکیده
منابع مشابه
Epistemic Modeling with Justifications
Existing logical models do not fairly represent epistemic situations with fallible justifications, e.g., Russell’s Prime Minister example, though such scenarios have long been at the center of epistemic studies. We introduce justification epistemic models, JEM, which can handle such scenarios. JEM makes justifications prime objects and draws a distinction between accepted and knowledge-producin...
متن کاملA Logic of Plausible Justifications
In this work, we combine the frameworks of Justification Logics and Logics of Plausibility-Based Beliefs to build a logic for MultiAgent Systems where each agent can explicitly state his justification for believing in a given sentence. Our logic is a normal modal logic based on the standard Kripke semantics, where we provide a semantic definition for the evidence terms and define the notion of ...
متن کاملReferential logic of proofs
We introduce an extension of the propositional logic of single-conclusion proofs by the second order variables denoting the reference constructors of the type “the formula which is proved by x.” The resulting Logic of Proofs with References, FLPref, is shown to be decidable, and to enjoy soundness and completeness with respect to the intended provability semantics. We show that FLPref provides ...
متن کاملGraded Modalities in Epistemic Logic
We propo~ an epistemic logic with so-called graded modalities, in which certain types of knowledge are expressible that are less absolute than in traditional epistemic logic. Beside 'absolute knowledge' (which does not allow for any exception), we a r e also able to express 'accepting r if there at most n exceptions to r This logic may be employed in decision support systems where there are dif...
متن کاملEpistemic Reasoning in Logic Programs
Although epistemic logic programming has an enhanced capacity to handle complex incomplete information reasoning and represent agents’ epistemic behaviours, it embeds a significantly higher computational complexity than non-disjunctive and disjunctive answer set programming. In this paper, we investigate some important properties of epistemic logic programs. In particular, we show that Lee and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9209-3